Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Brendan Juba
aka: Brendan A. Juba
Washington University in St. Louis, USA
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 97 matches
- 2024
- Hai S. Le, Brendan Juba, Roni Stern:
Learning Safe Action Models with Partial Observability. AAAI 2024: 20159-20167 - Arijit Shaw, Brendan Juba, Kuldeep S. Meel:
An Approximate Skolem Function Counter. AAAI 2024: 8108-8116 - Daniel Hsu, Jizhou Huang, Brendan Juba:
Polynomial time auditing of statistical subgroup fairness for Gaussian data. CoRR abs/2401.16439 (2024) - Argaman Mordoch, Enrico Scala, Roni Stern, Brendan Juba:
Safe Learning of PDDL Domains with Conditional Effects - Extended Version. CoRR abs/2403.15251 (2024) - 2023
- Ionela Georgiana Mocanu, Vaishak Belle, Brendan Juba:
Learnability with PAC Semantics for Multi-agent Beliefs. Theory Pract. Log. Program. 23(4): 730-747 (2023) - Andrew Estornell, Sanmay Das, Brendan Juba, Yevgeniy Vorobeychik:
Popularizing Fairness: Group Fairness and Individual Welfare. AAAI 2023: 7485-7493 - Argaman Mordoch, Brendan Juba, Roni Stern:
Learning Safe Numeric Action Models. AAAI 2023: 12079-12086 - Ionela Georgiana Mocanu, Vaishak Belle, Brendan Juba:
Learnability with PAC Semantics for Multi-agent Beliefs. AAMAS 2023: 2604-2606 - Ionela Georgiana Mocanu, Vaishak Belle, Brendan Juba:
Learnability with PAC Semantics for Multi-agent Beliefs. CoRR abs/2306.05490 (2023) - Argaman Mordoch, Shahaf S. Shperberg, Roni Stern, Brendan Juba:
Enhancing Numeric-SAM for Learning with Few Observations. CoRR abs/2312.10705 (2023) - Arijit Shaw, Brendan Juba, Kuldeep S. Meel:
An Approximate Skolem Function Counter. CoRR abs/2312.12026 (2023) - 2022
- Brendan Juba, Roni Stern:
Learning Probably Approximately Complete and Safe Action Models for Stochastic Worlds. AAAI 2022: 9795-9804 - Zihao Deng, Siddartha Devic, Brendan Juba:
Polynomial Time Reinforcement Learning in Factored State MDPs with Linear Value Functions. AISTATS 2022: 11280-11304 - Leda Liang, Brendan Juba:
Conditional Linear Regression for Heterogeneous Covariances. AISTATS 2022: 6182-6199 - Priyanka Golia, Brendan Juba, Kuldeep S. Meel:
A Scalable Shannon Entropy Estimator. CAV (1) 2022: 363-384 - Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie:
Hardness of Maximum Likelihood Learning of DPPs. COLT 2022: 3800-3819 - Brendan Juba, Roni Stern:
An Example of the SAM+ Algorithm for Learning Action Models for Stochastic Worlds. CoRR abs/2203.12499 (2022) - Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie:
Hardness of Maximum Likelihood Learning of DPPs. CoRR abs/2205.12377 (2022) - Priyanka Golia, Brendan Juba, Kuldeep S. Meel:
A Scalable Shannon Entropy Estimator. CoRR abs/2206.00921 (2022) - Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie:
Hardness of Maximum Likelihood Learning of DPPs. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- Tomer Shahar, Shashank Shekhar, Dor Atzmon, Abdallah Saffidine, Brendan Juba, Roni Stern:
Safe Multi-Agent Pathfinding with Time Uncertainty. J. Artif. Intell. Res. 70: 923-954 (2021) - Mahdi Cheraghchi, Elena Grigorescu, Brendan Juba, Karl Wimmer, Ning Xie:
List Learning with Attribute Noise. AISTATS 2021: 2215-2223 - Atish Agarwala, Abhimanyu Das, Brendan Juba, Rina Panigrahy, Vatsal Sharan, Xin Wang, Qiuyi Zhang:
One Network Fits All? Modular versus Monolithic Task Formulations in Neural Networks. ICLR 2021 - Honghua Zhang, Brendan Juba, Guy Van den Broeck:
Probabilistic Generating Circuits. ICML 2021: 12447-12457 - Alexander Philipp Rader, Ionela Georgiana Mocanu, Vaishak Belle, Brendan Juba:
Learning Implicitly with Noisy Data in Linear Arithmetic. IJCAI 2021: 1410-1417 - Brendan Juba, Hai S. Le, Roni Stern:
Safe Learning of Lifted Action Models. KR 2021: 379-389 - Honghua Zhang, Brendan Juba, Guy Van den Broeck:
Probabilistic Generating Circuits. CoRR abs/2102.09768 (2021) - Atish Agarwala, Abhimanyu Das, Brendan Juba, Rina Panigrahy, Vatsal Sharan, Xin Wang, Qiuyi Zhang:
One Network Fits All? Modular versus Monolithic Task Formulations in Neural Networks. CoRR abs/2103.15261 (2021) - Brendan Juba, Hai S. Le, Roni Stern:
Safe Learning of Lifted Action Models. CoRR abs/2107.04169 (2021) - Siddartha Devic, Zihao Deng, Brendan Juba:
Polynomial Time Reinforcement Learning in Correlated FMDPs with Linear Value Functions. CoRR abs/2107.05187 (2021)
skipping 67 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-05-11 20:02 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint